Automata and Algebras for Infinite Words and Trees
نویسنده
چکیده
Regular languages can be studied not just for finite words, but also for finite trees, infinite words and infinite trees. Almost all of the theory of regular languages, such as closure under boolean operations, works also for these extensions, but the constructions are significantly more challenging and mathematically interesting. For instance, automata for infinite words can be determinised under a suitable choice of acceptance condition, but the proof requires an intricate combinatorial construction. In the first part of my talk, I will describe the now classical results on automata recognising regular languages of infinite words and infinite trees. I will mention the connection of automata with monadic secondorder logic, discovered by Büchi and Rabin, which has been one of the main sources of inspiration in the theory of automata for infinite objects. More on these topics can be found in the general survey [4] or in the collection of more specialised surveys [1]. The second part of my talk will be on the algebraic approach to regular languages. For finite words, the algebraic approach is to use semigroups instead of automata. The beauty of the algebraic approach is that it uncovers connections between classical mathematical concepts and formal language theory. For instance, a celebrated theorem of Schützenberger says that a regular language of finite words can be defined by a regular expression without the star (but with complementation) if and only if the language can be recognised by a semigroup that does not contain any nontrivial group. There is also a well understood algebraic theory for infinite words, which uses variants of semigroups. The algebraic theory of for regular languages of finite words is described in the book [3], and its extensions to infinite words are described in the book [2]. However, the algebraic theory of infinite trees, or even finite trees, is currently not well understood, and seems to be a very challenging problem. I will end my talk by describing this problem, and why it might be interesting for people studying algebra and coalgebra.
منابع مشابه
Finite automata on infinite objects
Infinite behaviors of several kinds of finite automata on infinite objects are studied. Namely, alternating finite automata on r0-words, finite tree automata on infinite trees which move from the root infinitely, and finite biautomata on two-sided infinite words are investigated through six types of acceptance conditions. Each condition is an appropriate extension of the one used for acceptance...
متن کاملAutomatic presentations of infinite structures
The work at hand studies the possibilities and limitations of the use of finite automata in the description of infinite structures. An automatic presentation of a countable structure consists of a labelling of the elements of the structure by finite words over a finite alphabet in a consistent way so as to allow each of the relations of the structure to be recognised, given the labelling, by a ...
متن کاملForms of Determinism for Automata∗
We survey in this paper some variants of the notion of determinism, refining the spectrum between non-determinism and determinism. We present unambiguous automata, strongly unambiguous automata, prophetic automata, guidable automata, and history-deterministic automata. We instantiate these various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost f...
متن کاملSchloss Dagstuhl – Leibniz-Center for Informatics GmbH, Dagstuhl Publishing, Saarbrücken/Wadern,
We survey in this paper some variants of the notion of determinism, refining the spectrum betweennon-determinism and determinism. We present unambiguous automata, strongly unambiguousautomata, prophetic automata, guidable automata, and history-deterministic automata. Weinstantiate these various notions for finite words, infinite words, finite trees, infinite trees, datalanguages...
متن کاملAutomata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of semistructured data, timed automata and extended temporal logics. This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power a...
متن کامل